Gaussian Sampling in Lattice Based Cryptography
نویسندگان
چکیده
Modern lattice-based cryptosystems require sampling from discrete Gaussian distributions. We review lattice based schemes and collect their requirements for sampling from discrete Gaussians. Then we survey the algorithms implementing such sampling and assess their practical performance. Finally we draw some conclusions regarding the best candidates for implementation on different platforms in the typical parameter range.
منابع مشابه
Gaussian Sampling in Lattice-Based Cryptography
Although rather recent, lattice-based cryptography has stood out on numer-ous points, be it by the variety of constructions that it allows, by its expectedresistance to quantum computers, of by its efficiency when instantiated on someclasses of lattices.One of the most powerful tools of lattice-based cryptography is Gaussiansampling. At a high level, it allows to prove the k...
متن کاملOn the Design of Hardware Building Blocks for Modern Lattice-Based Encryption Schemes
We present both a hardware and a software implementation variant of the learning with errors (LWE) based cryptosystem presented by Lindner and Peikert. This work helps in assessing the practicality of lattice-based encryption. For the software implementation, we give a comparison between a matrix and polynomial based variant of the LWE scheme. This module includes multiplication in polynomial r...
متن کاملGLITCH: A Discrete Gaussian Testing Suite for Lattice-based Cryptography
Lattice-based cryptography is one of the most promising areas within post-quantum cryptography, and offers versatile, efficient, and high performance security services. The aim of this paper is to verify the correctness of the discrete Gaussian sampling component, one of the most important modules within lattice-based cryptography. In this paper, the GLITCH software test suite is proposed, whic...
متن کاملGaussian Sampling Precision in Lattice Cryptography
Security parameters and attack countermeasures for Lattice-based cryptosystems have not yet matured to the level that we now expect from RSA and Elliptic Curve implementations. Many modern Ring-LWE and other lattice-based public key algorithms require high precision random sampling from the Discrete Gaussian distribution. The sampling procedure often represents the biggest implementation bottle...
متن کاملOn Rejection Sampling Algorithms for Centered Discrete Gaussian Distribution over Integers
Lattice-based cryptography has been accepted as a promising candidate for public key cryptography in the age of quantum computing. Discrete Gaussian sampling is one of fundamental operations in many lattice-based cryptosystems. In this paper, we discuss a sub-problem of discrete Gaussian sampling, which is to sample from a centered discrete Gaussian distribution DZ,σ,c over the integers Z with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015